Parallel Parsing of Arithmetic Expressions

نویسنده

  • Y. N. Srikant
چکیده

New parallel algorithms for parsing arithmetic expressions on mesh-connected, shuffle-connected, cube-connected, and cube-connected cycles models of parallel computation are presented. On the meshconnected computer, the algorithm requires n processors and O(&) time; on the other models, n processors and O(log2 n ) time are required. Index Terns-Arithmetic expressions, parallel processing, parsing. Manuscript received March 15, 1987; revised September 20, 1988. The author is with the Department of Computer Science and Automation, IEEE Log Number 8930175. Indian Institute of Science, Bangalore 560012, India. OO18-9340190/01OO-0130$01 .OO

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Parallel Algorithm for Arithmetic Expression Parsing

We present an optimal expression parsing algorithm using SIMD-SM EREW model of computation. with a time complexiry of O(&) using &processors.

متن کامل

A Note on the First Geometric-Arithmetic Index of Hexagonal Systems and Phenylenes

The first geometric-arithmetic index was introduced in the chemical theory as the summation of 2 du dv /(du  dv ) overall edges of the graph, where du stand for the degree of the vertex u. In this paper we give the expressions for computing the first geometric-arithmetic index of hexagonal systems and phenylenes and present new method for describing hexagonal system by corresponding a simple g...

متن کامل

A High-Speed Dual-Bit Parallel Adder based on Carbon Nanotube ‎FET technology for use in arithmetic units

In this paper, a Dual-Bit Parallel Adder (DBPA) based on minority function using Carbon-Nanotube Field-Effect Transistor (CNFET) is proposed. The possibility of having several threshold voltage (Vt) levels by CNFETs leading to wide use of them in designing of digital circuits. The main goal of designing proposed DBPA is to reduce critical path delay in adder circuits. The proposed design positi...

متن کامل

Two Methods for Extending Hierarchical Rules from the Bilingual Chart Parsing

This paper studies two methods for training hierarchical MT rules independently of word alignments. Bilingual chart parsing and EM algorithm are used to train bitext correspondences. The first method, rule arithmetic, constructs new rules as combinations of existing and reliable rules used in the bilingual chart, significantly improving the translation accuracy on the German-English and Farsi-E...

متن کامل

The Parallel Evaluation of Arithmetic Expressions Without Division

As computers become capable of executing more arithmetic operations simultaneously, the question of compiling for such machines becomes more important. In this correspondence we consider arbitrary arithmetic expressions of n distinct variables with operations restricted to addition, subtraction, and multiplication. We first construct a scheme whereby any such expression can be evaluated in at m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987